0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.15/0.36 % Computer : n019.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 1200 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Thu Jul 15 06:09:29 EDT 2021 0.15/0.37 % CPUTime : 0.15/0.37 % Number of cores: 8 0.15/0.37 % Python version: Python 3.6.8 0.15/0.37 # Version: 2.6rc1-ho 0.15/0.39 # No SInE strategy applied 0.15/0.39 # Trying AutoSched0 for 59 seconds 0.40/0.59 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.40/0.59 # and selection function SelectMaxLComplexAvoidPosPred. 0.40/0.59 # 0.40/0.59 # Preprocessing time : 0.089 s 0.40/0.59 0.40/0.59 # Proof found! 0.40/0.59 # SZS status Theorem 0.40/0.59 # SZS output start CNFRefutation 0.40/0.59 thf(conj_2, conjecture, ord_le519537037nres_a @ (if_Ref1724547303nres_a @ (b) @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_2)). 0.40/0.59 thf(help_If_1_1_If_001t__Refine____Basic____Mirabelle____kwjuvthmas__Onres_Itf__a_J_T, axiom, ![X767:refine424419629nres_a, X768:refine424419629nres_a]:(if_Ref1724547303nres_a @ ($true) @ X767 @ X768)=(X767), file('/export/starexec/sandbox/benchmark/theBenchmark.p', help_If_1_1_If_001t__Refine____Basic____Mirabelle____kwjuvthmas__Onres_Itf__a_J_T)). 0.40/0.59 thf(help_If_2_1_If_001t__Refine____Basic____Mirabelle____kwjuvthmas__Onres_Itf__a_J_T, axiom, ![X689:refine424419629nres_a, X690:refine424419629nres_a]:(if_Ref1724547303nres_a @ (~$true) @ X689 @ X690)=(X690), file('/export/starexec/sandbox/benchmark/theBenchmark.p', help_If_2_1_If_001t__Refine____Basic____Mirabelle____kwjuvthmas__Onres_Itf__a_J_T)). 0.40/0.59 thf(conj_0, hypothesis, (b=>ord_le519537037nres_a @ s1 @ (refine1198353288_RES_a @ (collect_a @ phi))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.40/0.59 thf(conj_1, hypothesis, (ord_le519537037nres_a @ s2 @ (refine1198353288_RES_a @ (collect_a @ phi))<=~(b)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 0.40/0.59 thf(c_0_5, negated_conjecture, ~(((~b|ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $true @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi)))&(b|ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $false @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi))))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])). 0.40/0.59 thf(c_0_6, plain, ![X767:refine424419629nres_a, X768:refine424419629nres_a]:(if_Ref1724547303nres_a @ $true @ X767 @ X768)=(X767), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[help_If_1_1_If_001t__Refine____Basic____Mirabelle____kwjuvthmas__Onres_Itf__a_J_T])])). 0.40/0.59 thf(c_0_7, plain, ![X689:refine424419629nres_a, X690:refine424419629nres_a]:(if_Ref1724547303nres_a @ $false @ X689 @ X690)=(X690), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[help_If_2_1_If_001t__Refine____Basic____Mirabelle____kwjuvthmas__Onres_Itf__a_J_T])])). 0.40/0.59 thf(c_0_8, negated_conjecture, (((~b|b)&(~ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $false @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi))|b))&((~b|~ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $true @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi)))&(~ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $false @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi))|~ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $true @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])). 0.40/0.59 thf(c_0_9, plain, ![X2756:refine424419629nres_a, X2757:refine424419629nres_a]:(if_Ref1724547303nres_a @ $true @ X2756 @ X2757)=(X2756), inference(variable_rename,[status(thm)],[c_0_6])). 0.40/0.59 thf(c_0_10, hypothesis, (~b|ord_le519537037nres_a @ s1 @ (refine1198353288_RES_a @ (collect_a @ phi))), inference(fof_nnf,[status(thm)],[conj_0])). 0.40/0.59 thf(c_0_11, hypothesis, (~b=>ord_le519537037nres_a @ s2 @ (refine1198353288_RES_a @ (collect_a @ phi))), inference(fof_simplification,[status(thm)],[conj_1])). 0.40/0.59 thf(c_0_12, plain, ![X2653:refine424419629nres_a, X2654:refine424419629nres_a]:(if_Ref1724547303nres_a @ $false @ X2653 @ X2654)=(X2654), inference(variable_rename,[status(thm)],[c_0_7])). 0.40/0.59 thf(c_0_13, negated_conjecture, (~b|~ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $true @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.40/0.59 thf(c_0_14, plain, ![X2:refine424419629nres_a, X1:refine424419629nres_a]:(if_Ref1724547303nres_a @ $true @ X1 @ X2)=(X1), inference(split_conjunct,[status(thm)],[c_0_9])). 0.40/0.59 thf(c_0_15, hypothesis, (ord_le519537037nres_a @ s1 @ (refine1198353288_RES_a @ (collect_a @ phi))|~b), inference(split_conjunct,[status(thm)],[c_0_10])). 0.40/0.59 thf(c_0_16, hypothesis, (b|ord_le519537037nres_a @ s2 @ (refine1198353288_RES_a @ (collect_a @ phi))), inference(fof_nnf,[status(thm)],[c_0_11])). 0.40/0.59 thf(c_0_17, negated_conjecture, (b|~ord_le519537037nres_a @ (if_Ref1724547303nres_a @ $false @ s1 @ s2) @ (refine1198353288_RES_a @ (collect_a @ phi))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.40/0.59 thf(c_0_18, plain, ![X1:refine424419629nres_a, X2:refine424419629nres_a]:(if_Ref1724547303nres_a @ $false @ X1 @ X2)=(X2), inference(split_conjunct,[status(thm)],[c_0_12])). 0.40/0.59 thf(c_0_19, negated_conjecture, ~b, inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14]), c_0_15])). 0.40/0.59 thf(c_0_20, hypothesis, (b|ord_le519537037nres_a @ s2 @ (refine1198353288_RES_a @ (collect_a @ phi))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.40/0.59 thf(c_0_21, negated_conjecture, ~ord_le519537037nres_a @ s2 @ (refine1198353288_RES_a @ (collect_a @ phi)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18]), c_0_19])). 0.40/0.59 thf(c_0_22, hypothesis, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20, c_0_19]), c_0_21]), ['proof']). 0.40/0.59 # SZS output end CNFRefutation 0.40/0.59 # Proof object total steps : 23 0.40/0.59 # Proof object clause steps : 9 0.40/0.59 # Proof object formula steps : 14 0.40/0.59 # Proof object conjectures : 7 0.40/0.59 # Proof object clause conjectures : 4 0.40/0.59 # Proof object formula conjectures : 3 0.40/0.59 # Proof object initial clauses used : 6 0.40/0.59 # Proof object initial formulas used : 5 0.40/0.59 # Proof object generating inferences : 0 0.40/0.59 # Proof object simplifying inferences : 6 0.40/0.59 # Training examples: 0 positive, 0 negative 0.40/0.59 # Parsed axioms : 424 0.40/0.59 # Removed by relevancy pruning/SinE : 0 0.40/0.59 # Initial clauses : 940 0.40/0.59 # Removed in clause preprocessing : 186 0.40/0.59 # Initial clauses in saturation : 754 0.40/0.59 # Processed clauses : 826 0.40/0.59 # ...of these trivial : 18 0.40/0.59 # ...subsumed : 200 0.40/0.59 # ...remaining for further processing : 607 0.40/0.59 # Other redundant clauses eliminated : 95 0.40/0.59 # Clauses deleted for lack of memory : 0 0.40/0.59 # Backward-subsumed : 5 0.40/0.59 # Backward-rewritten : 14 0.40/0.59 # Generated clauses : 3205 0.40/0.59 # ...of the previous two non-trivial : 2516 0.40/0.59 # Contextual simplify-reflections : 47 0.40/0.59 # Paramodulations : 3002 0.40/0.59 # Factorizations : 20 0.40/0.59 # NegExts : 13 0.40/0.59 # Equation resolutions : 104 0.40/0.59 # Propositional unsat checks : 0 0.40/0.59 # Propositional check models : 0 0.40/0.59 # Propositional check unsatisfiable : 0 0.40/0.59 # Propositional clauses : 0 0.40/0.59 # Propositional clauses after purity: 0 0.40/0.59 # Propositional unsat core size : 0 0.40/0.59 # Propositional preprocessing time : 0.000 0.40/0.59 # Propositional encoding time : 0.000 0.40/0.59 # Propositional solver time : 0.000 0.40/0.59 # Success case prop preproc time : 0.000 0.40/0.59 # Success case prop encoding time : 0.000 0.40/0.59 # Success case prop solver time : 0.000 0.40/0.59 # Current number of processed clauses : 533 0.40/0.59 # Positive orientable unit clauses : 47 0.40/0.59 # Positive unorientable unit clauses: 0 0.40/0.59 # Negative unit clauses : 19 0.40/0.59 # Non-unit-clauses : 467 0.40/0.59 # Current number of unprocessed clauses: 2435 0.40/0.59 # ...number of literals in the above : 9361 0.40/0.59 # Current number of archived formulas : 0 0.40/0.59 # Current number of archived clauses : 25 0.40/0.59 # Clause-clause subsumption calls (NU) : 47207 0.40/0.59 # Rec. Clause-clause subsumption calls : 27912 0.40/0.59 # Non-unit clause-clause subsumptions : 225 0.40/0.59 # Unit Clause-clause subsumption calls : 5005 0.40/0.59 # Rewrite failures with RHS unbound : 0 0.40/0.59 # BW rewrite match attempts : 26 0.40/0.59 # BW rewrite match successes : 7 0.40/0.59 # Condensation attempts : 0 0.40/0.59 # Condensation successes : 0 0.40/0.59 # Termbank termtop insertions : 103560 0.40/0.59 0.40/0.59 # ------------------------------------------------- 0.40/0.59 # User time : 0.201 s 0.40/0.59 # System time : 0.017 s 0.40/0.59 # Total time : 0.218 s 0.40/0.59 # Maximum resident set size: 2684 pages 0.40/0.59 EOF